Boolean circuit programming: A new paradigm to design parallel algorithms
نویسندگان
چکیده
The Boolean circuit has been an important model of parallel computation, but not many parallel algorithms have been designed on this model because it is ‘awkward to program.’ To overcome this drawback, we propose a description language for designing parallel algorithms. This description language is to parallel algorithms what the pseudocode is to sequential algorithms. Through example codes, we show that the description language is a convenient tool to design parallel algorithms due to its general iterative and recursive structures and the ease of modular design.
منابع مشابه
A Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملGSAT Enhanced with Learning Automata and Multilevel Paradigm
A large number of problems that occur in knowledgerepresentation, learning, very large scale integration technology (VLSI-design), and other areas of artificial intelligence, are essentially satisfiability problems. The satisfiability problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. The growing need for more efficient and scalable a...
متن کاملManySAT: a Parallel SAT Solver
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses a portfolio of complementary sequential algorithms obtained through careful variations of the standard DPLL algorithm. Additionally, each sequentia...
متن کاملClp(b) : Combining Simplicity and Eeciency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver in the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the \glass-box" approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four new ...
متن کاملclp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the “glass-box” approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 7 شماره
صفحات -
تاریخ انتشار 2009